A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
نویسندگان
چکیده
This paper presents a lower bound of Ω(D+ √ n/ logn) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = Ω(logn), in the bounded message model. This establishes the asymptotic nearoptimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D + √ n log∗ n).
منابع مشابه
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
This paper presents a lower bound of ~ (D + p n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D = (logn), in the bounded message model. This establishes the asymptotic near-optimality of existing time-e cient distributed algorithms for the problem, whose complexity is O(D + p n log n).
متن کاملA near - tight lower bound on the time
This paper presents a lower bound of ~ (D + p n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = (log n), in the bounded message model. This establishes the asymptotic near-optimality of existing time-eecient distributed algorithms for the problem, whose complexity is O(D + p n log n).
متن کاملEnergy-Efficient Distributed Minimum Spanning Tree Construction: Tight Bounds and Algorithms
Traditionally, the performance of distributed algorithms has been measured in terms of running time and message complexity. However, in many settings, a more accurate and relevant measure of performance is required. In ad hoc wireless networks, energy is a very critical factor for measuring the efficiency of a distributed algorithm. Thus in addition to the traditional time and message complexit...
متن کاملTight Bounds For Distributed MST Verification
This paper establishes tight bounds for the Minimum-weight Spanning Tree (MST) verification problem in the distributed setting. Specifically, we provide an MST verification algorithm that achieves simultaneously Õ(|E|) messages and Õ( √ n+D) time, where |E| is the number of edges in the given graph G and D is G’s diameter. On the negative side, we show that any MST verification algorithm must s...
متن کاملFilling the Bandwidth Gap in Distributed Complexity for Global Problems
Communication complexity theory is a powerful tool to bound time complexity lower bounds of distributed algorithms for global problems such as minimum spanning tree (MST) and shortest path. While it often leads the nearly-tight lower bounds for many problems, polylogarithmic complexity gaps still lies between the currently best upper and lower bounds. In this paper, we propose a new approach fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 30 شماره
صفحات -
تاریخ انتشار 2000